- inverse algorithm
- мат.инверсный алгоритм
English-Russian scientific dictionary. 2008.
English-Russian scientific dictionary. 2008.
Inverse kinematics — is the process of determining the parameters of a jointed flexible object (a kinematic chain) in order to achieve a desired pose. Inverse kinematics are also relevant to game programming and 3D animation, where a common use is making sure game… … Wikipedia
Inverse transform sampling — Inverse transform sampling, also known as the probability integral transform, is a method of generating sample numbers at random from any probability distribution given its cumulative distribution function (cdf). This method is generally… … Wikipedia
Inverse distance weighting — (IDW) is a method for multivariate interpolation, a process of assigning values to unknown points by using values from usually scattered set of known points. A general form of finding an interpolated value u for a given point x using IDW is an… … Wikipedia
Inverse quadratic interpolation — In numerical analysis, inverse quadratic interpolation is a root finding algorithm, meaning that it is an algorithm for solving equations of the form f ( x ) = 0. The idea is to use quadratic interpolation to approximate the inverse of f . This… … Wikipedia
Inverse iteration — In numerical analysis, inverse iteration is an iterative eigenvalue algorithm. Based on the power method, this method improves on its performance. Whereas the power method always converges to the largest eigenvalue, inverse iteration also enables … Wikipedia
Extended Euclidean algorithm — The extended Euclidean algorithm is an extension to the Euclidean algorithm for finding the greatest common divisor (GCD) of integers a and b : it also finds the integers x and y in Bézout s identity: ax + by = gcd(a, b). ,(Typically either x or… … Wikipedia
Modular multiplicative inverse — The modular multiplicative inverse of an integer a modulo m is an integer x such that That is, it is the multiplicative inverse in the ring of integers modulo m. This is equivalent to The multiplicative inverse of a modulo m exists if and only if … Wikipedia
Root-finding algorithm — A root finding algorithm is a numerical method, or algorithm, for finding a value x such that f(x) = 0, for a given function f. Such an x is called a root of the function f. This article is concerned with finding scalar, real or complex roots,… … Wikipedia
Cipolla's algorithm — In computational number theory, Cipolla s algorithm is a technique for solving a congruence of the form x2 = n, where , so n is the square of x, and where p is an odd prime. Here denotes the finite field with p elements; . Th … Wikipedia
k-nearest neighbor algorithm — KNN redirects here. For other uses, see KNN (disambiguation). In pattern recognition, the k nearest neighbor algorithm (k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance… … Wikipedia
Multiplicative inverse — The reciprocal function: y = 1/x. For every x except 0, y represents its multiplicative inverse. In mathematics, a multiplicative inverse or reciprocal for a number x, denoted by 1/x or x−1, is a number which when multiplied by x yields the… … Wikipedia